Stability of Fuzzy Elman Neural Network Using Joint Spectral Radius Spectral Radius of Matrix Dynamic Systems
نویسندگان
چکیده
in this paper, a new method is derived for the existence of a common quadratic Lyapunov function for Robust Stability Analysis of Fuzzy Elman Neural Network using joint spectral radius spectral radius of Matrix.
منابع مشابه
Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra
In this paper, we discuss some properties of joint spectral {radius(jsr)} and generalized spectral radius(gsr) for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...
متن کاملCartesian decomposition of matrices and some norm inequalities
Let X be an n-square complex matrix with the Cartesian decomposition X = A + i B, where A and B are n times n Hermitian matrices. It is known that $Vert X Vert_p^2 leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)$, where $p geq 2$ and $Vert . Vert_p$ is the Schatten p-norm. In this paper, this inequality and some of its improvements ...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملLower bounds for the spectral radius of a matrix
In this paper we develop lower bounds for the spectral radius of symmetric , skew{symmetric, and arbitrary real matrices. Our approach utilizes the well{known Leverrier{Faddeev algorithm for calculating the co-eecients of the characteristic polynomial of a matrix in conjunction with a theorem by Lucas which states that the critical points of a polynomial lie within the convex hull of its roots....
متن کامل